The Runtime Complexity (innermost) of the given CpxRelTRS could be proven to be BOUNDS(n^1, INF).

(0) Obligation:

Runtime Complexity Relative TRS:
The TRS R consists of the following rules:

a(C(x1, x2), y) → C(a(x1, y), a(x2, C(x1, x2)))
a(Z, y) → Z
eqZList(C(x1, x2), C(y1, y2)) → and(eqZList(x1, y1), eqZList(x2, y2))
eqZList(C(x1, x2), Z) → False
eqZList(Z, C(y1, y2)) → False
eqZList(Z, Z) → True
second(C(x1, x2)) → x2
first(C(x1, x2)) → x1

The (relative) TRS S consists of the following rules:

and(False, False) → False
and(True, False) → False
and(False, True) → False
and(True, True) → True

Rewrite Strategy: INNERMOST

(1) RenamingProof (EQUIVALENT transformation)

Renamed function symbols to avoid clashes with predefined symbol.

(2) Obligation:

Runtime Complexity Relative TRS:
The TRS R consists of the following rules:

a(C(x1, x2), y) → C(a(x1, y), a(x2, C(x1, x2)))
a(Z, y) → Z
eqZList(C(x1, x2), C(y1, y2)) → and(eqZList(x1, y1), eqZList(x2, y2))
eqZList(C(x1, x2), Z) → False
eqZList(Z, C(y1, y2)) → False
eqZList(Z, Z) → True
second(C(x1, x2)) → x2
first(C(x1, x2)) → x1

The (relative) TRS S consists of the following rules:

and(False, False) → False
and(True, False) → False
and(False, True) → False
and(True, True) → True

Rewrite Strategy: INNERMOST

(3) TypeInferenceProof (BOTH BOUNDS(ID, ID) transformation)

Infered types.

(4) Obligation:

Innermost TRS:
Rules:
a(C(x1, x2), y) → C(a(x1, y), a(x2, C(x1, x2)))
a(Z, y) → Z
eqZList(C(x1, x2), C(y1, y2)) → and(eqZList(x1, y1), eqZList(x2, y2))
eqZList(C(x1, x2), Z) → False
eqZList(Z, C(y1, y2)) → False
eqZList(Z, Z) → True
second(C(x1, x2)) → x2
first(C(x1, x2)) → x1
and(False, False) → False
and(True, False) → False
and(False, True) → False
and(True, True) → True

Types:
a :: C:Z → C:Z → C:Z
C :: C:Z → C:Z → C:Z
Z :: C:Z
eqZList :: C:Z → C:Z → False:True
and :: False:True → False:True → False:True
False :: False:True
True :: False:True
second :: C:Z → C:Z
first :: C:Z → C:Z
hole_C:Z1_0 :: C:Z
hole_False:True2_0 :: False:True
gen_C:Z3_0 :: Nat → C:Z

(5) OrderProof (LOWER BOUND(ID) transformation)

Heuristically decided to analyse the following defined symbols:
a, eqZList

(6) Obligation:

Innermost TRS:
Rules:
a(C(x1, x2), y) → C(a(x1, y), a(x2, C(x1, x2)))
a(Z, y) → Z
eqZList(C(x1, x2), C(y1, y2)) → and(eqZList(x1, y1), eqZList(x2, y2))
eqZList(C(x1, x2), Z) → False
eqZList(Z, C(y1, y2)) → False
eqZList(Z, Z) → True
second(C(x1, x2)) → x2
first(C(x1, x2)) → x1
and(False, False) → False
and(True, False) → False
and(False, True) → False
and(True, True) → True

Types:
a :: C:Z → C:Z → C:Z
C :: C:Z → C:Z → C:Z
Z :: C:Z
eqZList :: C:Z → C:Z → False:True
and :: False:True → False:True → False:True
False :: False:True
True :: False:True
second :: C:Z → C:Z
first :: C:Z → C:Z
hole_C:Z1_0 :: C:Z
hole_False:True2_0 :: False:True
gen_C:Z3_0 :: Nat → C:Z

Generator Equations:
gen_C:Z3_0(0) ⇔ Z
gen_C:Z3_0(+(x, 1)) ⇔ C(Z, gen_C:Z3_0(x))

The following defined symbols remain to be analysed:
a, eqZList

(7) NoRewriteLemmaProof (LOWER BOUND(ID) transformation)

Could not prove a rewrite lemma for the defined symbol a.

(8) Obligation:

Innermost TRS:
Rules:
a(C(x1, x2), y) → C(a(x1, y), a(x2, C(x1, x2)))
a(Z, y) → Z
eqZList(C(x1, x2), C(y1, y2)) → and(eqZList(x1, y1), eqZList(x2, y2))
eqZList(C(x1, x2), Z) → False
eqZList(Z, C(y1, y2)) → False
eqZList(Z, Z) → True
second(C(x1, x2)) → x2
first(C(x1, x2)) → x1
and(False, False) → False
and(True, False) → False
and(False, True) → False
and(True, True) → True

Types:
a :: C:Z → C:Z → C:Z
C :: C:Z → C:Z → C:Z
Z :: C:Z
eqZList :: C:Z → C:Z → False:True
and :: False:True → False:True → False:True
False :: False:True
True :: False:True
second :: C:Z → C:Z
first :: C:Z → C:Z
hole_C:Z1_0 :: C:Z
hole_False:True2_0 :: False:True
gen_C:Z3_0 :: Nat → C:Z

Generator Equations:
gen_C:Z3_0(0) ⇔ Z
gen_C:Z3_0(+(x, 1)) ⇔ C(Z, gen_C:Z3_0(x))

The following defined symbols remain to be analysed:
eqZList

(9) RewriteLemmaProof (LOWER BOUND(ID) transformation)

Proved the following rewrite lemma:
eqZList(gen_C:Z3_0(+(1, n4287_0)), gen_C:Z3_0(n4287_0)) → False, rt ∈ Ω(1 + n4287₀)

Induction Base:
eqZList(gen_C:Z3_0(+(1, 0)), gen_C:Z3_0(0)) →_R^Ω(1)
False

Induction Step:
eqZList(gen_C:Z3_0(+(1, +(n4287_0, 1))), gen_C:Z3_0(+(n4287_0, 1))) →_R^Ω(1)
and(eqZList(Z, Z), eqZList(gen_C:Z3_0(+(1, n4287_0)), gen_C:Z3_0(n4287_0))) →_R^Ω(1)
and(True, eqZList(gen_C:Z3_0(+(1, n4287_0)), gen_C:Z3_0(n4287_0))) →_IH
and(True, False) →_R^Ω(0)
False

We have rt ∈ Ω(n¹) and sz ∈ O(n). Thus, we have irc_R ∈ Ω(n).

(10) Complex Obligation (BEST)

(11) Obligation:

Innermost TRS:
Rules:
a(C(x1, x2), y) → C(a(x1, y), a(x2, C(x1, x2)))
a(Z, y) → Z
eqZList(C(x1, x2), C(y1, y2)) → and(eqZList(x1, y1), eqZList(x2, y2))
eqZList(C(x1, x2), Z) → False
eqZList(Z, C(y1, y2)) → False
eqZList(Z, Z) → True
second(C(x1, x2)) → x2
first(C(x1, x2)) → x1
and(False, False) → False
and(True, False) → False
and(False, True) → False
and(True, True) → True

Types:
a :: C:Z → C:Z → C:Z
C :: C:Z → C:Z → C:Z
Z :: C:Z
eqZList :: C:Z → C:Z → False:True
and :: False:True → False:True → False:True
False :: False:True
True :: False:True
second :: C:Z → C:Z
first :: C:Z → C:Z
hole_C:Z1_0 :: C:Z
hole_False:True2_0 :: False:True
gen_C:Z3_0 :: Nat → C:Z

Lemmas:
eqZList(gen_C:Z3_0(+(1, n4287_0)), gen_C:Z3_0(n4287_0)) → False, rt ∈ Ω(1 + n4287₀)

Generator Equations:
gen_C:Z3_0(0) ⇔ Z
gen_C:Z3_0(+(x, 1)) ⇔ C(Z, gen_C:Z3_0(x))

No more defined symbols left to analyse.

(12) LowerBoundsProof (EQUIVALENT transformation)

The lowerbound Ω(n¹) was proven with the following lemma:
eqZList(gen_C:Z3_0(+(1, n4287_0)), gen_C:Z3_0(n4287_0)) → False, rt ∈ Ω(1 + n4287₀)

(13) BOUNDS(n^1, INF)

(14) Obligation:

Innermost TRS:
Rules:
a(C(x1, x2), y) → C(a(x1, y), a(x2, C(x1, x2)))
a(Z, y) → Z
eqZList(C(x1, x2), C(y1, y2)) → and(eqZList(x1, y1), eqZList(x2, y2))
eqZList(C(x1, x2), Z) → False
eqZList(Z, C(y1, y2)) → False
eqZList(Z, Z) → True
second(C(x1, x2)) → x2
first(C(x1, x2)) → x1
and(False, False) → False
and(True, False) → False
and(False, True) → False
and(True, True) → True

Types:
a :: C:Z → C:Z → C:Z
C :: C:Z → C:Z → C:Z
Z :: C:Z
eqZList :: C:Z → C:Z → False:True
and :: False:True → False:True → False:True
False :: False:True
True :: False:True
second :: C:Z → C:Z
first :: C:Z → C:Z
hole_C:Z1_0 :: C:Z
hole_False:True2_0 :: False:True
gen_C:Z3_0 :: Nat → C:Z

Lemmas:
eqZList(gen_C:Z3_0(+(1, n4287_0)), gen_C:Z3_0(n4287_0)) → False, rt ∈ Ω(1 + n4287₀)

Generator Equations:
gen_C:Z3_0(0) ⇔ Z
gen_C:Z3_0(+(x, 1)) ⇔ C(Z, gen_C:Z3_0(x))

No more defined symbols left to analyse.

(15) LowerBoundsProof (EQUIVALENT transformation)

The lowerbound Ω(n¹) was proven with the following lemma:
eqZList(gen_C:Z3_0(+(1, n4287_0)), gen_C:Z3_0(n4287_0)) → False, rt ∈ Ω(1 + n4287₀)

(16) BOUNDS(n^1, INF)